Exact Output Rate of Generalized Peres Algorithm for Generating Random Bits from Loaded Dice

نویسنده

  • Sung-il Pae
چکیده

We report a computation of the exact output rate of recently-discovered generalization of Peres algorithm for generating random bits from loaded dice. Instead of resorting to brute-force computation for all possible inputs, which becomes quickly impractical as the input size increases, we compute the total output length on equiprobable sets of inputs by dynamic programming using a recursive formula. Keywords—Random number generation, Peres algorithm, exact output rate, random bits, loaded dice.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Optimal Algorithms for Generating Random Bits from Loaded Dice

The problem of generating random bits from an arbitrary biased coin, dating back to von Neumann’s 1951 work, has been extensively studied. Specifically, given a fixed number of biased coin tosses with unknown probability, it is well known how to generate random bits with an asymptotically optimal efficiency. In this paper we address two basic questions related to the generation of random bits. ...

متن کامل

A Universal Scheme for Transforming Binary Algorithms to Generate Random Bits from Loaded Dice

In this paper, we present a universal scheme for transforming an arbitrary algorithm for biased 2-face coins to generate random bits from the general source of an m-sided die, hence enabling the application of existing algorithms to general sources. In addition, we study approaches of efficiently generating a prescribed number of random bits from an arbitrary biased coin. This contrasts with mo...

متن کامل

Efficiently Generating Random Bits from Finite State Markov Chains

The problem of random number generation from an uncorrelated random source (of unknown probability distribution) dates back to von Neumann’s 1951 work. Elias (1972) generalized von Neumann’s scheme and showed how to achieve optimal efficiency in unbiased random bits generation. Hence, a natural question is what if the sources are correlated? Both Elias and Samuelson proposed methods for generat...

متن کامل

Streaming Algorithms for Optimal Generation of Random Bits

Generating random bits from a source of biased coins (the biased is unknown) is a classical question that was originally studied by von Neumann. There are a number of known algorithms that have asymptotically optimal information efficiency, namely, the expected number of generated random bits per input bit is asymptotically close to the entropy of the source. However, only the original von Neum...

متن کامل

generating a random sample from gamma distribution using generalized exponential distribution.

in this paper, we discuss generating a random sample from gamma distribution using generalized exponential distribution.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013